Competing Matchmaking

نویسنده

  • Ettore Damiano
چکیده

We study how competing matchmakers use prices to sort participants into search markets, where they form random pairwise matches, and how equilibrium outcomes compare with monopoly in terms of prices, search market structure and sorting efficiency. The role of prices to facilitate sorting is compromised by the need to survive price competition. We show that the competitive outcome can be less efficient in sorting than the monopoly outcome. In particular, the need to survive price competition results in a smaller and less efficient quality difference in equilibrium search markets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards Bidirectional Distributed Matchmaking (Short Paper)

Matchmaking is the process of introducing two or more agents to each other. Current matchmaking techniques are unidirectional and fail to address large-scale and highly dynamic systems with time constraints. We propose a new distributed technique which scales well, and still maintains relatively low matchmaking time and communication overhead. Our technique introduces very low storage and compu...

متن کامل

Resource Matching and a Matchmaking Service for an Intelligent Grid

We discuss the application of matching in the area of resource discovery and resource allocation in grid computing. We present a formal definition of matchmaking, overview algorithms to evaluate different matchmaking expressions, and develop a matchmaking service for an intelligent grid environment. Keywords—Grid, Matchmaking, Ontology

متن کامل

Qualitative Analysis on Matchmaking Techniques for Web Service Discovery

The ample adoption of web services raises the challenging problem in web service discovery. Web service discovery is the process of finding appropriate services for the user defined tasks. The big challenge in web service discovery is to discover the services that suit the user requirements and to enhance the efficiency and accuracy in matchmaking procedures. This poster focuses on matchmaking ...

متن کامل

Matchmaking: How similar is what I want to what I get

We introduce matchmaking as a specific setting for similarity assessment. While in many domains similarity assessment is between pairs of entities with equal status, this is not true for matchmaking in general. Usually, in matchmaking there exists a source request which triggers search for the most similar set of available entities. Whether an entity is acceptable depends highly on the applicat...

متن کامل

Agent service matchmaking algorithm for autonomic element with semantic and QoS constraints

Agent service description and matchmaking problem for autonomic element has been taken as one of the most important issue in the field of autonomic computing based on agent and multi-agent system. Considering the semantic and QoS for capability description of agent service are two important issues during matchmaking, the factors of semantic and QoS during matchmaking are considered together, an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004